HESSIAN-BASED SAMPLING FOR HIGH-DIMENSIONAL MODEL REDUCTION
نویسندگان
چکیده
منابع مشابه
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatiallyand temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-dimensional control spaces in the form of discretized initial conditions. Solution of such inverse problems in “real-time” is often intractable. This motivates the construction of reduced-order models that can be used as ...
متن کاملHessian-based model reduction: large-scale inversion and prediction
Hessian-based model reduction was previously proposed as an approach in deriving reduced models for the solution of large-scale linear inverse problems by targeting accuracy in observation outputs. A controltheoretic view of Hessian-based model reduction that hinges on the equality between the Hessian and the transient observability gramian of the underlying linear system is presented. The mode...
متن کاملHessian eigenmaps: locally linear embedding techniques for high-dimensional data.
We describe a method for recovering the underlying parametrization of scattered data (m(i)) lying on a manifold M embedded in high-dimensional Euclidean space. The method, Hessian-based locally linear embedding, derives from a conceptual framework of local isometry in which the manifold M, viewed as a Riemannian submanifold of the ambient Euclidean Space R(n), is locally isometric to an open, c...
متن کاملRobust Hessian Locally Linear Embedding Techniques for High-Dimensional Data
Recently manifold learning has received extensive interest in the community of pattern recognition. Despite their appealing properties, most manifold learning algorithms are not robust in practical applications. In this paper, we address this problem in the context of the Hessian locally linear embedding (HLLE) algorithm and propose a more robust method, called RHLLE, which aims to be robust ag...
متن کاملArnoldi-based Sampling for High-dimensional Optimization using Imperfect Data
We present a sampling strategy suitable for optimization problems characterized by high-dimensional design spaces and noisy outputs. Such outputs can arise, for example, in time-averaged objectives that depend on chaotic states. The proposed sampling method is based on a generalization of Arnoldi’s method used in Krylov iterative methods. We show that Arnoldi-based sampling can effectively esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Uncertainty Quantification
سال: 2019
ISSN: 2152-5080
DOI: 10.1615/int.j.uncertaintyquantification.2019028753